Package edu.uky.ai.path
Class Main
java.lang.Object
edu.uky.ai.path.Main
public class Main
extends java.lang.Object
This exercise will demonstrate how many different kinds of search algorithms
can be implemented using the same basic process with slight variations in
how the next state is chosen.
The problem being solved in this example is a simple navigation problem in a
2D grid. Your goal is to guide a robot from its starting location to its
destination (marked with a flag). After each iteration of the search
process, the current state of the search will be drawn on the screen to show
which locations have been considered, which have not been considered, and
which can be considered next.
- Author:
- Stephen G. Ware